Acyclicchoosability相关论文
...
A proper vertex coloring of a graph is acyclic if every cycle uses at least three colors.A graph G is acyclically k-choo......